A survey on retrial queues

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast simulation of retrial queues

This paper describes a discrete-time retrial queue and shows how importance sampling simulations can be applied for estimating the probability of large orbit content and the overflow fraction of primary calls.

متن کامل

Stability of Retrial Queues with Versatile Retrial Policy

We consider in this paper the stability of retrial queues with a versatile retrial policy. We obtain sufficient conditions for the stability by the strong coupling convergence to a stationary ergodic regime for various models of retrial queues including a model with two types of customers, a model with breakdowns of the server, a model with negative customers, and a model with batch arrivals. F...

متن کامل

On tandem blocking queues with a common retrial queue

We consider systems of tandem blocking queues having a common retrial queue. The model represents dynamics of short TCP transfers in the Internet. Analytical results are available only for a specific example with two queues in tandem. We propose approximation procedures involving simple analytic expressions, based on mean value analysis (MVA) and on fixed point approach (FPA). The mean sojourn ...

متن کامل

Multiserver Retrial Queues with After-call Work

This paper considers a multiserver queueing system with finite capacity. Customers that find the service facility being fully occupied are blocked and enter a virtual waiting room (called orbit). Blocked customers stay in the orbit for an exponentially distributed time and retry to occupy an idle server again. After completing a service, the server starts an additional job that we call an after...

متن کامل

Finite-source Retrial Queues with Applications*

We consider a single-server retrial queueing system with a finite number of homogeneous sources generating requests after a random time. The service of an arriving customer finding the server idle starts immediately; otherwise the request enters into an orbit from where the calls are repeated after a random time. Upon completion of a service, with a certain probability the server searches for a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Queueing Systems

سال: 1989

ISSN: 0257-0130,1572-9443

DOI: 10.1007/bf01150861